Regularized Linear Programming Discriminant Rule with Folded Concave Penalty for Ultrahigh-Dimensional Data

نویسندگان

چکیده

We propose the regularized linear programming discriminant (LPD) rule with folded concave penalty in ultrahigh-dimensional regime. use local approximation (LLA) algorithm to redirect model a weighted ℓ1 model. The strong oracle property of solution constructed by one-step is verified. In addition, we efficient and parallelizable algorithms based on feature space split address computational challenges due ultrahigh dimensionality. proposed feature-split compared existing methods both numerical simulations applications real data examples. comparisons suggest that method works well for dimensions, while solver alternating direction multiplier (ADMM) may fail such high dimensions. Supplementary materials this article are available online.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decision Rule Extraction for Regularized Multiple Criteria Linear Programming Model

Due to the flexibility of multi-criteria optimization, Regularized Multiple Criteria Linear Programming (RMCLP) has received attention in decision support systems. Numerous theoretical and empirical studies have demonstrated that RMCLP is effective and efficient in classifying large scale data sets. However, a possible limitation of RMCLP is poor interpretability and low comprehensibility for e...

متن کامل

Algorithms for Regularized Linear Discriminant Analysis

This paper is focused on regularized versions of classification analysis and their computation for highdimensional data. A variety of regularized classification methods has been proposed and we critically discuss their computational aspects. We formulate several new algorithms for regularized linear discriminant analysis, which exploits a regularized covariance matrix estimator towards a regula...

متن کامل

Stochastic linear programming games with concave preferences

We study stochastic linear programming games: a class of stochastic cooperative games whose payoffs under any realization of uncertainty are determined by a specially structured linear program. These games can model a variety of settings, including inventory centralization and cooperative network fortification. We focus on the core of these games under an allocation scheme that determines how p...

متن کامل

Computation of Regularized Linear Discriminant Analysis

This paper is focused on regularized versions of classification analysis and their computation for high-dimensional data. A variety of regularized classification methods has been proposed and we critically discuss their computational aspects. We formulate several new algorithms for shrinkage linear discriminant analysis, which exploits a shrinkage covariance matrix estimator towards a regular t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Graphical Statistics

سال: 2022

ISSN: ['1061-8600', '1537-2715']

DOI: https://doi.org/10.1080/10618600.2022.2143785